Technical Note—An Improved Lower Bound to the Minimum Fleet Size Problem
نویسندگان
چکیده
منابع مشابه
An Improved Lower Bound on the Minimum Number of Triangulations
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points in the plane have been intensively studied in recent years. For most classes of geometric graphs it is now known that point sets in convex position minimize their number. However, it is still unclear which point sets minimize the number of geometric triangulations; the so-called double circles a...
متن کاملImproved lower bound on an Euclidean Ramsey problem
It was previously shown that any two-colour colouring of K(Cn) must contain a monochromatic planar K4 subgraph for n ≥ N ∗, where 6 ≤ N ∗ ≤ N and N is Graham’s number. The bound was later [2] improved to 11 ≤ N∗ ≤ N . In this article, it is improved to 13 ≤ N∗ ≤ N .
متن کاملThree New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem
In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...
متن کاملImproved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound
We give a function h : {0, 1} → {0, 1} such that every deMorgan formula of size n3−o(1)/r2 agrees with h on at most a fraction of 1 2 + 2 −Ω(r) of the inputs. This improves the previous average-case lower bound of Komargodski and Raz (STOC, 2013). Our technical contributions include a theorem that shows that the “expected shrinkage” result of H̊astad (SIAM J. Comput., 1998) actually holds with v...
متن کاملAn improved lower bound related to the Furstenberg-Sárközy theorem
Let D(n) denote the cardinality of the largest subset of the set {1, 2, . . . , n} such that the difference of no pair of elements is a square. A well-known theorem of Furstenberg and Sárközy states that D(n) = o(n). In the other direction, Ruzsa has proven that D(n) & nγ for γ = 1 2 ( 1 + log 7 log 65 ) ≈ 0.733077. We improve this to γ = 1 2 ( 1 + log 12 log 205 ) ≈ 0.733412.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 1983
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.17.4.471